19 research outputs found
Addressing Trust Challenges in Blockchain Oracles Using Asymmetric Byzantine Quorums
Distributed Computing in Blockchain Technology (BCT) hinges on a trust
assumption among independent nodes. Without a third-party interface or what is
known as a Blockchain Oracle, it can not interact with the external world. This
Oracle plays a crucial role by feeding extrinsic data into the Blockchain,
ensuring that Smart Contracts operate accurately in real time. The Oracle
problem arises from the inherent difficulty in verifying the truthfulness of
the data sourced by these Oracles. The genuineness of a Blockchain Oracle is
paramount, as it directly influences the Blockchain's reliability, credibility,
and scalability. To tackle these challenges, a strategy rooted in Byzantine
fault tolerance {\phi} is introduced. Furthermore, an autonomous system for
sustainability and audibility, built on heuristic detection, is put forth. The
effectiveness and precision of the proposed strategy outperformed existing
methods using two real-world datasets, aimed to meet the authenticity standards
for Blockchain Oracles.Comment: 12 pages, 16 figure
Distributed Fault-Tolerant Algorithm for Wireless Sensor Networks
Wireless Sensor Networks (WSNs) are a set of tiny autonomous and interconnected devices. These nodes are scattered in a region of interest to collect information about the surrounding environment depending on the intended application. In many applications, the network is deployed in harsh environments such as battlefield where the nodes are susceptible to damage. In addition, nodes may fail due to energy depletion and breakdown in the onboard electronics. The failure of nodes may leave some areas uncovered and degrade the fidelity of the collected data. Therefore, establish a fault-tolerant mechanism is very crucial. Given the resource-constrained setup, this mechanism should impose the least overhead and performance impact. This paper focuses on recovery process after a fault detection phase in WSNs. We present an algorithm to recover faulty node called Distributed Fault-Tolerant Algorithm (DFTA).The performance evaluation is tested through simulation to evaluate some factors such as: Packet delivery ratio, control overhead, memory overhead and fault recovery delay. We compared our results with referenced algorithm: Fault Detection in Wireless Sensor Networks (FDWSN), and found that our DFTA performance outperforms that of FDWSN
Outltier Detection Approach Using Bayes Classifiers in Wireless Sensor Networks.
International audienc
Efficient and scalable ACO-based task scheduling for green cloud computing environment
International audienc